Computational Aspects of Reduced Basis
نویسندگان
چکیده
Two variations of a method for reducing controllers for systems described by partial diierential equations (PDEs) are compared. In the rst method, the controller reduction is accomplished by projection of a large scale nite element approximation of the PDE controller onto a low order basis that is computed using the proper orthogonal decomposition (POD). The second method involves computing a reduced order controller using the low order POD basis. An advantage to the rst method is that the low order compensator retains more of the information of the full order controller since it is obtained through a projection. An advantage to the second method is that it is computationally more tractable as it does not require the full order compen-sator matrices. Simulations are included.
منابع مشابه
Enumeration of Conformers of Octahedral [M(ABC)_{6}] Complex on the Basis of Computational Group Theory
Conformers of [M(ABC)6] complex have been enumerated on the basis of computational group theory, where M is the central metal, and ABC is the ligand, bound to M through A. Based on the 16 conformers of the M(AB)6 core unit, 7173 conformers have been found for the [M(ABC)6] complex, which are assigned to nine point groups, 1 D3d, 4 D3, 4 S6, 5 C2h, 7 C3, 182 C2, 15 Cs, 23 Ci, and 6932 C1.
متن کاملNumerical method for solving optimal control problem of the linear differential systems with inequality constraints
In this paper, an efficient method for solving optimal control problems of the linear differential systems with inequality constraint is proposed. By using new adjustment of hat basis functions and their operational matrices of integration, optimal control problem is reduced to an optimization problem. Also, the error analysis of the proposed method is nvestigated and it is proved that the orde...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملAN ADAPTIVE WAVELET SOLUTION TO GENERALIZED STOKES PROBLEM
In this paper we will present an adaptive wavelet scheme to solvethe generalized Stokes problem. Using divergence free wavelets, theproblem is transformed into an equivalent matrix vector system, thatleads to a positive definite system of reduced size for thevelocity. This system is solved iteratively, where the applicationof the infinite stiffness matrix, that is sufficiently compressible,is r...
متن کاملLiTH ISY R Avoiding Mode Pairing when Updating Finite Element Models
Updating nite element models of complex mechanical structures requires some extra considerations It is stressed that the two most important aspects on up dating nite element models are parameter estimation properties and computational expenses A novel mode pairing free model updating formulation is found to have good parameter estimation properties The computational expenses are reduced with a ...
متن کامل